On Determinism and Unambiguity of Weighted Two-Way Automata
نویسندگان
چکیده
In this paper, we first study the conversion of weighted two-way automata to one-way automata. We show that this conversion preserves the unambiguity but does not preserve the determinism. Yet, we prove that the conversion of an unambiguous weighted one-way automaton into a two-way automaton leads to a deterministic two-way automaton. As a consequence, we prove that unambiguous weighted two-way automata are equivalent to deterministic weighted two-way automata in commutative semirings.
منابع مشابه
Unambiguity in Automata Theory
Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input. In this paper, we will investigate the nature of unambiguity in automata theory, pre...
متن کاملTiling-recognizable Two-dimensional Languages: from Non-determinism to Determinism through Unambiguity
Tiling recognizable two-dimensional languages, also known as REC, generalize recognizable string languages to two dimensions and share with them several theoretical properties. Nevertheless REC is not closed under complementation and the membership problem is NP-complete. This implies that this family REC is intrinsically non-deterministic. The natural and immediate definition of unambiguity co...
متن کاملSnake-Deterministic Tiling Systems
The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind of determinism, called snake, based on the boustrophedonic scanning strategy, that is a natural scanning strategy used by many algorithms on 2D arrays and pictures. We consider a snake-deterministic variant of tiling ...
متن کاملOn the decidability of $k$-Block determinism
Brüggemann-Klein and Wood define a one-unambiguous regular language as a language that can be recognized by a deterministic Glushkov automaton. They give a procedure performed on the minimal DFA, the BW-test, to decide whether a language is one-unambiguous. Block determinism is an extension of one-unambiguity while considering non-empty words as symbols and prefix-freeness as determinism. A blo...
متن کاملDeterministic recognizability of picture languages by Wang automata
Picture languages are a generalization of string languages to two dimensions: a picture is a twodimensional array of elements from a finite alphabet. Several classes of picture languages have been considered in the literature [5,7,3,10]. In particular, here we refer to class REC introduced in [5] with the aim to generalize to 2D the class of regular string languages. REC is a robust class that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 26 شماره
صفحات -
تاریخ انتشار 2015